On edge-disjoint pairs of matchings
نویسندگان
چکیده
منابع مشابه
On edge-disjoint pairs of matchings
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for |M |/|H |.
متن کاملNeighborhood conditions and edge-disjoint perfect matchings
Faudree, R.J., R.J. Gould and L.M. Lesniak, Neighborhood conditions and edge-disjoint perfect matchings, Discrete Mathematics 91 (1991) 33-43. A graph G satisfies the neighborhood condition ANC(G) 2 m if, for all pairs of vertices of G, the union of their neighborhoods has at least m vertices. For a fixed positive integer k, let G be a graph of even order n which satisfies the following conditi...
متن کاملOn disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
We show that any 2−factor of a cubic graph can be extended to a maximum 3−edge-colorable subgraph. We also show that the sum of sizes of maximum 2− and 3−edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices.
متن کاملOn a constructive characterization of a class of trees related to pairs of disjoint matchings
For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter α which eqauls the cardinality of the largest matching in those pairs. Also, define β to be the cardinality of a maximum matching of the graph. We give a constructive characterization of trees which satisfy the α = β equality. The proof of our main theorem is based on a ne...
متن کاملTRACTATUS on disjoint matchings in cubic graphs
In early 70s Berge conjectured that any bridgeless cubic graph contains five perfect matchings such that each edge belongs to at least one of them. In 1972 Fulkerson conjectured that, in fact, we can find six perfect matchings containing each edge exactly twice. By introducing the concept of an r-graph (a remarkable generalization of one of bridgeless cubic graph) Seymour in 1979 conjectured th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.061